Nonuniform Fast Cosine Transform and Chebyshev Pstd Algorithms
نویسندگان
چکیده
منابع مشابه
A Polynomial Approach to Fast Algorithms for Discrete Fourier-cosine and Fourier-sine Transforms
The discrete Fourier-cosine transform (cos-DFT), the discrete Fourier-sine transform (sin-DFT) and the discrete cosine transform (DCT) are closely related to the discrete Fourier transform (DFT) of real-valued sequences. This paper describes a general method for constructing fast algorithms for the cos-DFT, the sin-DFT and the DCT, which is based on polynomial arithmetic with Chebyshev polynomi...
متن کاملRoundoo Error Analysis of the Fast Cosine Transform and of Its Application to the Chebyshev Pseudospectral Method
The roundoo error analysis of several algorithms commonly used to compute the Fast Cosine Transform and the derivatives using the Chebyshev pseudospectral method are studied. We derive precise expressions for the algorithmic error, and using them we give new theoretical upper bounds and produce a statistical analysis. The results are compared with numerical experiments.
متن کاملChebyshev nonuniform sampling cascaded with the discrete cosine transform for optimum interpolation
This correspondence presents a new method for discrete representation of signals { g ( t ) , IE [ O , L ] , g e C*(O, L ) } consisting of a cascade having two stages: a) nonuniform sampling according to Chebyshev polynomial roots; and b) discrete cosine transform applied on the nonuniformly taken samples. We have proved that the considered signal samples and the coefficients of the correspondin...
متن کاملA Fast, Simple, and Stable Chebyshev-Legendre Transform Using an Asymptotic Formula
A fast, simple, and numerically stable transform for converting between Legendre and Chebyshev coefficients of a degree N polynomial in O(N(logN)2/ log logN) operations is derived. The basis of the algorithm is to rewrite a well-known asymptotic formula for Legendre polynomials of large degree as a weighted linear combination of Chebyshev polynomials, which can then be evaluated by using the di...
متن کاملThe Chebyshev fast Gauss and nonuniform fast Fourier transforms and their application to the evaluation of distributed heat potentials
We present a method for the fast and accurate computation of distributed (or volume) heat potentials in two dimensions. The distributed source is assumed to be given in terms of piecewise space-time Chebyshev polynomials. We discretize uniformly in time, whereas in space the polynomials are defined on the leaf nodes of a quadtree data structure. The quadtree can vary at each time step. We combi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001